Upper bounds for the index of cyclicity of a matrix∗

نویسندگان

  • B. De Schutter
  • Bart De Schutter
چکیده

We derive upper bounds for the index of cyclicity of a matrix as a function of the size of the matrix. This result can be used in the characterization of the ultimate behavior of the sequence of consecutive powers of a matrix in the max-plus algebra, which has maximum and addition as its basic operations. If the matrix is irreducible then it is well known that the ultimate behavior is cyclic. For reducible matrices the behavior is more complex, but it is also cyclic in nature. The length of the cycles corresponds to the index of cyclicity of the given matrix.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some remarks on the arithmetic-geometric index

Using an identity for effective resistances, we find a relationship between the arithmetic-geometric index and the global ciclicity index. Also, with the help of majorization, we find tight upper and lower bounds for the arithmetic-geometric index.

متن کامل

Sharp Bounds on the PI Spectral Radius

In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.

متن کامل

Bounds for the Co-PI index of a graph

In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.

متن کامل

Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs

In $1994,$ degree distance  of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of  multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the  multiplicative version of degree distance and multiplicative ver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999